Maximum independent sets near the upper bound
نویسندگان
چکیده
منابع مشابه
Independent Sets near the Lower Bound in Bounded Degree Graphs
By Brook’s Theorem, every n-vertex graph of maximum degree at most ∆ ≥ 3 and clique number at most ∆ is ∆-colorable, and thus it has an independent set of size at least n/∆. We give an approximate characterization of graphs with independence number close to this bound, and use it to show that the problem of deciding whether such a graph has an indepdendent set of size at least n/∆ + k has a ker...
متن کاملon the number of maximum independent sets of graphs
let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.
متن کاملAlgorithms for Maximum Independent Sets
An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O(2°.276”) ’ p lm roving on a previous bound of O(2”13). The improvement comes principally from three sources: first, a modified recursive algorithm based on a more detailed study of the possible subgraphs around a chosen vertex; second, an improvement, not in the algorithm but in the time...
متن کاملAN IMPROVED UPPER BOUND ON THE MAXIMUM SIZE OF k-PRIMITIVE SETS
For k ≥ 3 and sufficiently large n depending on k, Sujith Vijay recently provided non-trivial lower and upper bounds for the size of the largest subset of {1, 2, . . . , n} such that no element divides k others. The gap between his lower and upper bounds is, however, substantial, and here we provide a better upper bound which significantly reduces this gap for large k.
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.06.042